Closest 4-leaf power is fixed-parameter tractable
نویسندگان
چکیده
منابع مشابه
Closest 4-leaf power is fixed-parameter tractable
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf power. Herein, a 4-leaf power is a graph that can be constructed by considering an unrooted tree—the 4-leaf root—with leaves one-to-one labeled by the graph vertices, where we connect two graph vertices by an edge iff th...
متن کاملImbalance Is Fixed Parameter Tractable
In the Imbalance Minimization problem we are given a graph G = (V,E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of all the vertices is at most b. The imbalance of a vertex vi is the absolute value of the difference between the number of neighbors to the left and right of vi. The problem is also known as the Balanced Vertex Orderin...
متن کاملUnit Interval Editing is Fixed-Parameter Tractable
Given a graph G and integers k1, k2, and k3, the unit interval editing problem asks whether G can be transformed into a unit interval graph by at most k1 vertex deletions, k2 edge deletions, and k3 edge additions. We give an algorithm solving this problem in time 2 logk) · (n+m), where k := k1 +k2 +k3, and n,m denote respectively the numbers of vertices and edges of G. Therefore, it is fixed-pa...
متن کاملRotation Distance is Fixed-Parameter Tractable
Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we show that the rotation distance between two ordered trees is fixed-parameter tractable, in the parameter, k, the rotation distance. The proof relies on the kern...
متن کاملInterval Completion Is Fixed Parameter Tractable
We present an algorithm with runtime O(knm) for the following NP-complete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question [17, 7, 25, 14], first posed by Kaplan, Shamir and Tarjan, of whether this problem was fixed parameter tractable. The problem ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.01.007